Graph Implementation – Interactive Visualizers

Dive deep into graph theory concepts such as adjacency lists, DFS, BFS, and edge traversal through live interactive visualizers.

Session 1 – Problem 1

Introduction to graph representations using adjacency matrices.

Open Visualizer ↗

Session 1 – Problem 2

Explore graph traversal basics and node connectivity.

Open Visualizer ↗

Session 2 – Problem 1

Depth-first search visualization with recursion stack highlights.

Open Visualizer ↗

Session 2 – Problem 2

Breadth-first search implementation with queue visualization.

Open Visualizer ↗

Session 3 – Problem 1

Implement edge relaxation and shortest path algorithms visually.

Open Visualizer ↗

Session 3 – Problem 2

Explore topological sorting and directed graph cycles interactively.

Open Visualizer ↗